Imperfect Checking

نویسنده

  • Gereon Müller
چکیده

This article presents a unified solution to two long-standing problems concerning successive cyclicity. First, under the minimalist program of Chomsky (1995), a trigger for successive-cyclic wh-movement to [–wh] SpecC positions must be identified. Second, as noted by den Besten & Webelhuth (1990), there is a strict prohibition against unbound intermediate traces that result from a combination of successivecyclic wh-movement and remnant topicalization in German. The key proposal of this article is a new concept of “imperfect checking” of [+wh] and [–wh] features, which triggers successive-cyclic wh-movement. Moreover, as a parametrized reflex of successive cyclicity, extraposition can be forced. Obligatory extraposition accounts for the prohibition against unbound intermediate traces (via the strict cycle, economy, and general properties of features). In addition, the theory of imperfect checking yields interesting consequences for partial wh-movement and infinitives in German.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

µ-calculus Pushdown Module Checking with Imperfect State Information

The model checking problem for open systems (module checking) has recently been the subject of extensive study. The problem was first studied by Kupferman, Vardi, and Wolper for finite-state systems and properties expressed in the branching time logicsCTL and CTL∗. Further study continued mainly in two directions: considering systems equipped with a pushdown store, and considering environments ...

متن کامل

Decidability Results for ATL* with Imperfect Information and Perfect Recall

Alternating-time Temporal Logic (ATL∗) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATLi ) is well known to have an undecidable model-checking problem when agents have perfect recall. Studies have thus mostly focused either on agents without memory, or on alternative semantics to retrieve decidability. In this work we establish new decidability ...

متن کامل

Model Checking Pushdown Epistemic Game Structures

In this paper, we investigate the problem of verifying pushdown multiagent systems with imperfect information. As the formal model, we introduce pushdown epistemic game structures (PEGSs), an extension of pushdown game structures with epistemic accessibility relations (EARs). For the specification, we consider extensions of alternating-time temporal logics with epistemic modalities: ATEL, ATEL∗...

متن کامل

New results on pushdown module checking with imperfect information

Model checking of open pushdown systems (OPD) w.r.t. standard branching temporal logics (pushdown module checking or PMC) has been recently investigated in the literature, both in the context of environments with perfect and imperfect information about the system (in the last case, the environment has only a partial view of the system’s control states and stack content). For standard CTL, PMC w...

متن کامل

Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

We propose a formal proof of the undecidability of the model checking problem for alternatingtime temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non...

متن کامل

Pushdown Module Checking with Imperfect Information

The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imperfect information about the system. Recently, the perfect information case has been extended to infinite-state systems (pushdown module checking). In this paper, we extend pushdown module checking to the imperfect inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002